Domination game on uniform hypergraphs
نویسندگان
چکیده
منابع مشابه
Domination game on uniform hypergraphs
In this paper we introduce and study the domination game on hypergraphs. This is played on a hypergraph H by two players, namely Dominator and Staller, who alternately select vertices such that each selected vertex enlarges the set of vertices dominated so far. The game is over if all vertices of H are dominated. Dominator aims to finish the game as soon as possible, while Staller aims to delay...
متن کاملTransversal Game on Hypergraphs and the 3/4-Conjecture on the Total Domination Game
The 34 -Game Total Domination Conjecture posed by Henning, Klavžar and Rall [Combinatorica, to appear] states that if G is a graph on n vertices in which every component contains at least three vertices, then γtg(G) ≤ 34n, where γtg(G) denotes the game total domination number of G. Motivated by this conjecture, we raise the problem to a higher level by introducing a transversal game in hypergra...
متن کاملTotal Transversals and Total Domination in Uniform Hypergraphs
In 2012, the first three authors established a relationship between the transversal number and the domination number of uniform hypergraphs. In this paper, we establish a relationship between the total transversal number and the total domination number of uniform hypergraphs. We prove tight asymptotic upper bounds on the total transversal number in terms of the number of vertices, the number of...
متن کاملDirected domination in oriented hypergraphs
ErdH{o}s [On Sch"utte problem, Math. Gaz. 47 (1963)] proved that every tournament on $n$ vertices has a directed dominating set of at most $log (n+1)$ vertices, where $log$ is the logarithm to base $2$. He also showed that there is a tournament on $n$ vertices with no directed domination set of cardinality less than $log n - 2 log log n + 1$. This notion of directed domination number has been g...
متن کاملDomination game on forests
In the domination game studied here, Dominator and Staller alternately choose a vertex of a graph G and take it into a set D. The number of vertices dominated by the set D must increase in each single turn and the game ends when D becomes a dominating set of G. Dominator aims to minimize whilst Staller aims to maximize the number of turns (or equivalently, the size of the dominating set D obtai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2019
ISSN: 0166-218X
DOI: 10.1016/j.dam.2018.11.013